Euclidean spanner graphs with degree four
نویسندگان
چکیده
منابع مشابه
Self-spanner graphs
We introduce the (k, `)–self-spanners graphs to model non-reliable interconnection networks. Such networks can be informally characterized as follows: if at most ` edges have failed, as long as two vertices remain connected, the distance between these vertices in the faulty graph is at most k times the distance in the non-faulty graph. By fixing the values k and ` (called stretch factor and fau...
متن کاملFour-Vertex Degree Graphs of Nonsolvable Groups
For a finite group G, the character degree graph ∆(G) is the graph whose vertices are the primes dividing the degrees of the ordinary irreducible characters of G, with distinct primes p and q joined by an edge if pq divides some character degree of G. We determine all graphs with four vertices that occur as ∆(G) for some nonsolvable group G. Along with previously known results on character degr...
متن کاملLight subgraphs in graphs with average degree at most four
A graph H is said to be light in a family G of graphs if at least one member of G contains a copy of H and there exists an integer λ(H,G) such that each member G of G with a copy of H also has a copy K of H such that degG(v) ≤ λ(H,G) for all v ∈ V(K). In this paper, we study the light graphs in the class of graphs with small average degree, including the plane graphs with some restrictions on g...
متن کاملEecient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IR d and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p; q of points there is a path between them of length at most t times the Euclidean distance between p and q. An eecient implementation of a greedy algorithm is given that constructs a t-spanner having bounded degree such that the total le...
متن کاملLowest Degree k-Spanner: Approximation and Hardness
A k-spanner is a subgraph in which distances are approximately preserved, up to some given stretch factor k. We focus on the following problem: Given a graph and a value k, can we find a k-spanner that minimizes the maximum degree? While reasonably strong bounds are known for some spanner problems, they almost all involve minimizing the total number of edges. Switching the objective to the degr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90133-3